Inductive Learning in a Mixed Paradigm Setting

نویسندگان

  • David B. Skalak
  • Edwina L. Rissland
چکیده

In a precedent-bused domain one appeals to previous cases to support a solution, decision, explanation, or an argument. Experts typically use care in choosing cases in precedent-based domains, and apply such criteria as case relevance, prototypicality, and importance. In domains where both cases and rules are used, experts use an additional case selection criterion: the generalizations that a particular group of cases support. Domain experts use their knowledge of cases to forge the rules learned from those cases. In this paper, we explore inductive learning in a “mixed paradigm” setting, where both rule-based and case-based reasoning methods are used. In particular, we consider how the techniques of casebased reasoning in an adversarial, precedent-based domain can be used to aid a decision-tree based classification algorithm for (1) training set selection, (2) branching feature choice, and (3) induction policy preference and deliberate exploitation of inductive bias. We focus on how precedentbased argumentation may inform the selection of training examples used to build classification trees. The resulting decision trees may then be reexpressed as rules and incorporated into the mixed paradigm system. We discuss the heuristic control problems involved in incorporating an inductive learner into CABARET, a mixed paradigm reasoner. Finally, we present an empirical study in a legal domain of the classification trees generated by various training sets constructed by a case-based reasoning module.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logical settings for concept learning from incomplete examples in First Order Logic

We investigate here concept learning from incomplete examples. Our first purpose is to discuss to what extent logical learning settings have to be modified in order to cope with data incompleteness. More precisely we are interested in extending the learning from interpretations setting introduced by L. De Raedt that extends to relational representations the classical propositional (or attribute...

متن کامل

Applications of a Logical Discovery Engine

The clausal discovery engine CLAUDIEN is presented. CLAUDIEN discovers regularities in data and is s representative :of the inductive logic programming paradigm. As such, it represent s data and regu!aritles by means of first order clausal theories. Because the search space of c~ausal theories is larger-than that of attribute value representation, CLAUDIEN alSO accepts as input a declarative sp...

متن کامل

On Ordinal VC-Dimension and Some Notions of Complexity

We generalize the classical notion of VC-dimension to ordinal VC-dimension, in the context of logical learning paradigms. Logical learning paradigms encompass the numerical learning paradigms commonly studied in Inductive inference. A logical learning paradigm is defined as a set W of structures over some vocabulary, and a set D of first-order formulas that represent data. The sets of models of...

متن کامل

Title Design, implementation and evaluation of e-learning based on Paradigm 3 and Paradigm 4 of Kashman's theory and their comparison (in terms of academic achievement, motivation and satisfaction of medical education students).

The purpose of this study was to design, implement and evaluate e-learning based on the third and fourth Paradigms of Kashman's theory. The research method was quasi-experimental and mixed (qualitative and quantitative). The statistical population of the undergraduate students of Shahid Beheshti Medical Education Faculty of Tehran was selected by sampling method available to students of medical...

متن کامل

Statistical Relational Learning: An Inductive Logic Programming Perspective

In the past few years there has been a lot of work lying at the intersection of probability theory, logic programming and machine learning [14, 18, 13, 9, 6, 1, 11]. This work is known under the names of statistical relational learning [7, 5], probabilistic logic learning [4], or probabilistic inductive logic programming. Whereas most of the existing works have started from a probabilistic lear...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1990